A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
نویسندگان
چکیده
منابع مشابه
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Temporal databases, databases of events in an ordered domain, have attracted attention since the early 90’s, and the complexity of evaluating various queries on such databases has been analyzed [1, 10]. One important issue is an efficient algorithm for a query on an indefinite data over a linearly ordered domain, i.e., efficiently answering a query as to whether all possible models of incomplet...
متن کاملAutomata based verification over linearly ordered data domains
In this paper we work over linearly ordered data domains equipped with finitely many unary predicates and constants. We consider nondeterministic automata processing words and storing finitely many variables ranging over the domain. During a transition, these automata can compare the data values of the current configuration with those of the previous configuration using the linear order, the un...
متن کاملA Linear Time Algorithm for Ordered Partition
We present a deterministic linear time and space algorithm for ordered partition of a set T of n integers into n sets T0 ≤ T1 ≤ · · · ≤ Tn1/2−1, where |Ti| = θ(n ) and Ti ≤ Ti+1 means that maxTi ≤ minTi+1.
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملQuerying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
In recent years large amounts of electronic texts have become available providing a new base for empirical studies in linguistics and offering a chance to linguists to compare their theories with large amounts of utterances from “the real world”. While tagging with morphosyntactic categories has become a standard for almost all corpora, more and more of them are nowadays annotated with refined ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00142-1